import java.util.Scanner;

public class Main{
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNext()) {
            int n = scanner.nextInt();
            int[] arr = new int[n];
            for (int i = 0; i < arr.length; i++) {
                arr[i] = scanner.nextInt();
            }
            quicksort(arr, 0, arr.length - 1);
            for (int i = 0; i < arr.length; i++) {
                System.out.print(arr[i] + " ");
            }
        }
    }

    public static void quicksort(int[] arr, int first, int end) {
        if (first > end)
            return;
        int i = first;
        int j = end;
        int temp = arr[first];
        while (i != j) {
            while (temp <= arr[j] && i < j) {
                j--;
            }
            while (temp >= arr[i] && i < j) {
                i++;
            }
            if (i < j) {
                int a = arr[i];
                arr[i] = arr[j];
                arr[j] = a;
            }
        }
        if (i == j) {
            arr[first] = arr[i];
            arr[i] = temp;
        }
        quicksort(arr, first, i - 1);
        quicksort(arr, i + 1, end);
    }
}
